Longest Common Subsequence: A Method for Automatic Evaluation of Handwritten Essays
نویسنده
چکیده
Essays are used to evalaute student’s knowledge from early before itself. The aim of the proposed system is to evalaute the handwritten essays automatically. The proposed method is to develope an automated system to to evaluate handwritten student essays. For a single topic under study the students may refer more than one study material. According to the similarity of the contents a reference study material is constructed. The reference study material is used to evaluate the handwritten essays. The scanned image of the handwritten essays are used as the input in the proposed method. From the image texts are extracted for the evaluation. The Longest Common Subsequence (LCS) is used for the proposed system.
منابع مشابه
UAEMex at ImageCLEF 2016: Handwritten Retrieval
This paper describes the participation of the (UAEMex) at the ImageCLEF 2016 Handwritten Scanned Document Retrieval Task. We propose to use a skip-character text search method based on Longest Common Subsequence. Our system split all characters in query to find all Longest Common Subsequence in one line of text.
متن کاملAutomatic Evaluation of Machine Translation Quality Using Longest Common Subsequence and Skip-Bigram Statistics
In this paper we describe two new objective automatic evaluation methods for machine translation. The first method is based on longest common subsequence between a candidate translation and a set of reference translations. Longest common subsequence takes into account sentence level structure similarity naturally and identifies longest co-occurring insequence n-grams automatically. The second m...
متن کاملThe Comparison of Typed and Handwritten Essays of Iranian EFL Students in terms of Length, Spelling, and Grammar
This study attempted to compare typed and handwritten essays of Iranian EFL students in terms of length, spelling, and grammar. To administer the study, the researchers utilized Alice Touch Typing Tutor software to select 15 upper intermediate students with higher ability to write two essays: one typed and the other handwritten. The students were both males and females between the ages of 22 to...
متن کاملAutomatic ICD-10 coding algorithm using an improved longest common subsequence based on semantic similarity
ICD-10(International Classification of Diseases 10th revision) is a classification of a disease, symptom, procedure, or injury. Diseases are often described in patients' medical records with free texts, such as terms, phrases and paraphrases, which differ significantly from those used in ICD-10 classification. This paper presents an improved approach based on the Longest Common Subsequence (LCS...
متن کاملUsing longest common subsequence and character models to predict word forms
This paper presents an algorithm for automatic word forms inflection. We use the method of longest common subsequence to extract abstract paradigms from given pairs of basic and inflected word forms, as well as suffix and prefix features to predict this paradigm automatically. We elaborate this algorithm using combination of affix feature-based and character ngram models, which substantially en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015